//
// Created by nicemoe on 2021/8/8.
//

#include  <bits/stdc++.h>

using namespace std;

struct Node {
    int x, y;
};

bool operator<(Node a, Node b) {
    return a.x < b.x;
}

int main() {

    priority_queue<Node> pq;
    pq.push({1, 3});
    pq.push({3, 2});
    pq.push({2, 1});
    while (!pq.empty()) {
        cout << pq.top().x << ' ' << pq.top().y << endl;
        pq.pop();
    }
    return 0;
}
